ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
نویسندگان
چکیده
منابع مشابه
Scaling Algorithms for M - convex Function Minimization
M-convex functions have various desirable properties as convexity in discrete optimization. We can find a global minimum of an M-convex function by a greedy algorithm, i.e., so-called descent algorithms work for the minimization. In this paper, we apply a scaling technique to a greedy algorithm and propose an efficient algorithm for the minimization of an M-convex function. Computational result...
متن کاملSubmodular Function Minimization and Maximization in Discrete Convex Analysis
This paper sheds a new light on submodular function minimization and maximization from the viewpoint of discrete convex analysis. L-convex functions and M-concave functions constitute subclasses of submodular functions on an integer interval. Whereas L-convex functions can be minimized efficiently on the basis of submodular (set) function minimization algorithms, M-concave functions are identif...
متن کاملAlgorithms in Discrete Convex Analysis
This is a survey of algorithmic results in the theory of “discrete convex analysis” for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid-theoretic concepts, in ...
متن کاملPartial Proximal Minimization Algorithms for Convex Pprogramming
We consider an extension of the proximal minimization algorithm where only some of the minimization variables appear in the quadratic proximal term. We interpret the resulting iterates in terms of the iterates of the standard algorithm and we show a uniform descent property, which holds independently of the proximal terms used. This property is used to give simple convergence proofs of parallel...
متن کاملRandom algorithms for convex minimization problems
This paper deals with iterative gradient and subgradient methods with random feasibility steps for solving constrained convex minimization problems, where the constraint set is specified as the intersection of possibly infinitely many constraint sets. Each constraint set is assumed to be given as a level set of a convex but not necessarily differentiable function. The proposed algorithms are ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2017
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.60.216